Separation of Convex Sets via Barrier Cones

Separation of Convex Sets

A line L separates a set A from a collection S of plane sets if A is contained in one of the closed half-planes defined by L, while every set in S is contained in the complementary closed half-plane. Let f(n) be the largest integer such that for any collection F of n closed disks in the plane with pairwise disjoint interiors, there is a line that separates a disk in F from a subcollection of F ...

Bornological Completion of Locally Convex Cones

In this paper, firstly, we obtain some new results about bornological convergence in locally convex cones (which was studied in [1]) and then we introduce the concept of bornological completion for locally convex cones. Also, we prove that the completion of a bornological locally convex cone is bornological. We illustrate the main result by an example.

Characterization of the barrier parameter of homogeneous convex cones

We characterize the barrier parameter of the optimal self{concordant barriers for homogeneous cones. In particular, we prove that for homogeneous convex cones this parameter is the same as the rank of the corresponding Siegel domain. We also provide lower bounds on the barrier parameter in terms of the Carath eodory number of the cone. The bounds are tight for homogeneous self-dual cones.

Some separation axioms via modified θ-open sets

Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets

Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successive semidefinite programming (SDP) relaxations and the other on successive linear programming (LP) relaxations. Each of our methods generates a sequence of compact convex subsets Ck (k = 1, 2, . . . ) of Rn such that (...